The Liner Shipping Fleet Repositioning Problem with Cargo Flows

نویسندگان

  • Kevin Tierney
  • Rune Møller Jensen
چکیده

We solve an important problem for the liner shipping industry called the Liner Shipping Fleet Repositioning Problem (LSFRP). The LSFRP poses a large financial burden on liner shipping firms. During repositioning, vessels are moved between services in a liner shipping network. Shippers wish to reposition vessels as cheaply as possible without disrupting the cargo flows of the network. The LSFRP is characterized by chains of interacting activities with a multi-commodity flow over paths defined by the activities chosen. Despite its great industrial importance, the LSFRP has received little attention in the literature. We introduce a novel mathematical model of the LSFRP with cargo flows based on a carefully constructed graph and evaluate it on real world data from our industrial collaborator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Node Flow Model for the Inflexible Visitation Liner Shipping Fleet Repositioning Problem with Cargo Flows

We introduce a novel, node flow based mathematical model for the fixed-time version of a central problem in the liner shipping industry called the Liner Shipping Fleet Repositioning Problem (LSFRP). We call this version of the problem the Inflexible Visitation LSFRP (IVLSFRP). During repositioning, vessels are moved between routes in a liner shipping network. Shipping lines wish to reposition v...

متن کامل

A PDDL Domain for the Liner Shipping Fleet Repositioning Problem

The Liner Shipping Fleet Repositioning Problem (LSFRP) poses a large financial burden on liner shipping firms. During repositioning, vessels are moved between services in a liner shipping network. The LSFRP is characterized by chains of interacting activities, many of which have costs that are a function of their duration; for example, sailing slowly between two ports is cheaper than sailing qu...

متن کامل

Late Acceptance Hill Climbing for The Liner Shipping Fleet Repositioning Problem

Late Acceptance Hill Climbing (LAHC) has been shown to be an effective local search method for several types of optimization problems, such as on certain types of scheduling problems as well as the traveling salesman problem. We apply LAHC to a central problem in the liner shipping industry, the Liner Shipping Fleet Repositioning Problem (LSFRP). The LSFRP involves the movement of vessels betwe...

متن کامل

A Hybrid Reactive Tabu Search for Liner Shipping Fleet Repositioning

We solve the liner shipping fleet repositioning problem (LSFRP), a key problem in the liner shipping industry, using a hybrid reactive tabu search and simulated annealing algorithm in combination with novel local search neighborhoods. Liner carriers reposition vessels between services in order to add, remove or modify services in their network. Repositioning vessels costs between hundreds of th...

متن کامل

Optimizing Liner Shipping Fleet Repositioning Plans

With the incredible growth of containerization over the past half century, shipping lines and ports are facing increasing challenges in ensuring that containers arrive at their destinations on time and on budget. This dissertation addresses several critical problems to the operations of shipping lines and ports, and provides algorithms and mathematical models for use by shipping lines and port ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012